Petri nets and algebraic specifications

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Trace Logic and Petri Nets Specifications

This paper presents an experience in formal methods integration for the speciication and validation of distributed, fault-tolerant systems. The speciication formalisms we deal with are a trace logic, based on the CSP theory, and stochastic Petri nets. Their integration allows to combine the power of event traces to specify the behaviour of a system in an intuitive and modular way and the power ...

متن کامل

Siphons and Traps of Algebraic Petri Nets

We overview recent results concerning the symbolic veriication and calculation of siphons and traps for algebraic Petri nets and their relation to the net behavior.

متن کامل

Adapting Petri Nets Reductions to Promela Specifications

The interleaving of concurrent processes actions leads to the well-known combinatorial explosion problem. Petri nets theory provides some structural reductions to tackle this phenomenon by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that does not observe the modified...

متن کامل

Algebraic Higher-Order Nets: Graphs and Petri Nets as Tokens

Petri nets and Algebraic High-Level Nets are well-known to model parallel and concurrent systems. In this paper, we introduce the concept of Algebraic Higher-Order Nets, which allow to have dynamical tokens like graphs or (ordinary low-level) Petri nets. For this purpose, we specify graphs and Petri nets in the higher-order algebraic specification language HasCasl such that graphs and Petri net...

متن کامل

Algebraic System Analysis of Timed Petri Nets

We show that Continuous Timed Petri Nets (CTPN) can be modeled by generalized polynomial recurrent equations in the (min,+) semiring. We establish a correspondence between CTPN and Markov decision processes. We survey the basic system theoretical results available: behavioral (inputoutput) properties, algebraic representations, asymptotic regime. A particular attention is paid to the subclass o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1991

ISSN: 0304-3975

DOI: 10.1016/0304-3975(91)90203-e